On associated partitions
نویسندگان
چکیده
منابع مشابه
A Study on Associated Rules and Fuzzy Partitions for Classification
The amount of data for decision making has increased tremendously in the age of the digital economy. Decision makers who fail to proficiently manipulate the data produced may make incorrect decisions and therefore harm their business. Thus, the task of extracting and classifying the useful information efficiently and effectively from huge amounts of computational data is of special importance. ...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملNotes on Fibonacci Partitions
Abstract. Let f1 = 1, f2 = 2, f3 = 3, f4 = 5, . . . be the sequence of Fibonacci numbers. It is well known that for any natural n there is a unique expression n = fi1 + fi2 + · · · + fiq , such that ia+1 − ia > 2 for a = 1, 2, . . . , q− 1 (Zeckendorf Theorem). By means of it we find an explicit formula for the quantity Fh(n) of partitions of n with h summands, all parts of them are the pairwis...
متن کاملOn Partitions of En
Euclidean Ramsey theory [i-3] is that branch of combinatorics which deals with questions of the following type: Which finite subsets C of lE” have the property that for any partition of Euclidean n-space lE” into r classes, say [En = C1 U *** v C, , some Ci always contains a subset C’ which is the image of C under some Euclidean motion? Such C are said to be r-Ramsey for [En. We usually use alt...
متن کاملLattices on simplicial partitions
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of this fact l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1966
ISSN: 0528-2195
DOI: 10.21136/cpm.1966.117559